A Semantics of Compile-time Reeection

A new language incorporating both ML-style type checking and a limited form of reeec-tion is deened by giving an interpreter and showing how this interpreter may be interpreted as a compositional denotational semantics. The resulting language has a partial function as a compiler, but if the compiler terminates without a type error there will be no type-errors at runtime. Typing issues and rst-class environments are discussed as well.